How to Construct Double-Block-Length Hash Functions
نویسنده
چکیده
In this article, it is discussed how to construct a com pression function with 2n-bit output using a com ponent function with n-bit output. The compo nent function is either a smaller compression func tion or a block cipher. Some constructions are pre sented which compose collision-resistant hash func tions: Any collision-finding attack on them is at most as efficient as the birthday attack in the random or acle model or in the ideal cipher model. A new se curity notion is also introduced, which we call indis tinguishability in the iteration, with a construction satisfying the notion.
منابع مشابه
Some Plausible Constructions of Double-Block-Length Hash Functions
In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either a smaller compression function or a block cipher. Some constructions are presented which compose collision-resistant hash functions: Any collision-finding attack on them is at most as efficient as a birthday attack in the rand...
متن کاملA Class of secure Double Length Hash Functions
In this paper we constructed a class of double length hash functions which are maximally secure i.e. the birthday attack is the best possible attack. Recently, Joux [6] in Crypto-04 showed a multicollision attack on the classical iterated hash function which can be used to get the collision on the concatenated double length hash functions. Very recently, Lucks [10] also designed a double-pipe h...
متن کاملProvably Secure Double-Block-Length Hash Functions in a Black-Box Model
In CRYPTO’89, Merkle presented three double-block-length hash functions based on DES. They are optimally collision resistant in a black-box model, that is, the time complexity of any collision-finding algorithm for them is Ω(2 ) if DES is a random block cipher, where is the output length. Their drawback is that their rates are low. In this article, new double-block-length hash functions with hi...
متن کاملNew Attacks on all Double Block Length
In this paper attacks on double block length hash functions using a block cipher are considered. We present attacks on all double block length hash functions of hash rate 1, that is, hash functions where in each round the block cipher is used twice, s.t. one encryption is needed per message block. In particular, our attacks break the Parallel-DM presented at Crypto'9333].
متن کاملOn the Design of Secure and Fast Double Block Length Hash Functions
In this work the security of the rate-1 double block length hash functions, which based on a block cipher with a block length of n-bit and a key length of 2n-bit, is reconsidered. Counter-examples and new attacks are presented on this general class of double block length hash functions with rate 1, which disclose uncovered flaws in the necessary conditions given by Satoh et al. and Hirose. Prei...
متن کامل